- discrete matroid
- Математика: дискретный матроид
Универсальный англо-русский словарь. Академик.ру. 2011.
discrete matroid
Смотреть что такое "discrete matroid" в других словарях:
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Matroid intersection — In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection… … Wikipedia
Matroid embedding — In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties: (Accessibility Property) Every non empty feasible set X contains an element x such that X{x} is… … Wikipedia
Discrete geometry — A collection of circles and the corresponding unit disk graph Combinatorial geometry redirects here. The term combinatorial geometry is also used in the theory of matroids to refer to a simple matroid, especially in older texts. Discrete geometry … Wikipedia
Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… … Wikipedia
Colored matroid — In mathematics, a colored matroid is a matroid whose elements are labeled from a set of colors, which can be any set that suits the purpose, for instance the set of the first n positive integers, or the sign set {+, −}. The interest in colored… … Wikipedia
Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… … Wikipedia
K-set (geometry) — In discrete geometry, a k set of a finite point set S in the Euclidean plane is a subset of k elements of S that can be strictly separated from the remaining points by a line. More generally, in Euclidean space of higher dimensions, a k set of a… … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 … Wikipedia
